A Note on "Zippel Denesting"
نویسنده
چکیده
Radical simpliication is an important part of symbolic computation systems. Zippel 7] gave a suucient condition for a nested radical to be expressed in terms of radicals of lower nesting depth. We ll a lacuna in his proof, and show that his suucient condition is also necessary. Previous work by Landau and Miller 4] leads to an algorithm for the problem.
منابع مشابه
On the denesting of nested square roots
We present the basic theory of denesting nested square roots, from an elementary point of view, suitable for lower-level coursework. Necessary and sufficient conditions are given for direct denesting, where the nested expression is rewritten as a sum of square roots of rational numbers, and for indirect denesting, where the nested expression is rewritten as a sum of fourth-order roots of ration...
متن کاملDecreasing the Nesting Depth of Expressions Involving Square Roots
We develop the theory for decreasing the depth of nesting in expressions that contain square roots We show exactly when fourth roots enable denesting of expresstons not denestable with square roots only When we restrict our attention to denesting over the real numbers, we show in fact that no roots other than square roots or fourth roots are ever useful for denesting expressions containing squa...
متن کاملA note on circuit lower bounds from derandomization
We present an alternate proof of the result by Kabanets and Impagliazzo that derandomizing polynomial identity testing implies circuit lower bounds. Our proof is simpler, scales better, and yields a somewhat stronger result than the original argument.
متن کاملDecomposition of Polynomials
This diploma thesis is concerned with functional decomposition f = g ◦ h of polynomials. First an algorithm is described which computes decompositions in polynomial time. This algorithm was originally proposed by Zippel (1991). A bound for the number of minimal collisions is derived. Finally a proof of a conjecture in von zur Gathen, Giesbrecht & Ziegler (2010) is given, which states a classifi...
متن کاملLecture Notes on Linear Codes Defined over Finite Modules: the Extension Theorem and the Macwilliams Identities — for Use of Cimpa-unesco-tübitak Summer
These lecture notes discuss the extension problem and the MacWilliams identities for linear codes defined over finite modules.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Comput.
دوره 13 شماره
صفحات -
تاریخ انتشار 1992